/*
 * Copyright 2011 Fabian Wenzelmann
 * 
 * This file is part of Recognition-Procedures-for-Boolean-Functions.
 * 
 * Recognition-Procedures-for-Boolean-Functions is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * Recognition-Procedures-for-Boolean-Functions is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with Recognition-Procedures-for-Boolean-Functions.  If not, see <http://www.gnu.org/licenses/>.
 */

package de.wenzelmf.booleanFunction.lpb.util;

import de.wenzelmf.booleanFunction.dnf.DNF;

/**
 * This interface defines a method to convert a DNF to a LPB, if possible.
 * 
 * @author Fabian Wenzelmann
 * @version 1.0
 *
 */
public interface DNFToLPB
{
	/**
	 * Converts the input formula to a feasible LPB representation.
	 * 
	 *  If the conversion is not possible a ConversionException should be thrown.
	 *  
	 * @param phi The input DNF.
	 * @return A feasible LPB representation of &Phi;.
	 * @throws ConversionException If &Phi; cannot be represented as an LPB.
	 */
	public LPB convert(DNF phi) throws ConversionException;
}
